P versus NP problem - PDFSEARCH.IO - Document Search Engine

P versus NP problem
Results: 202

#	Item
121	Properties of NP-Complete Sets Christian Glaßer, A. Pavan, Alan L. Selman, Samik Sengupta ∗ † Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2004-01-15 13:02:20 Complexity classes NP P versus NP problem PP Sparse language P Cook–Levin theorem NP-hard Theoretical computer science Computational complexity theory Applied mathematics
122	Reductions between Disjoint NP-Pairs Christian Glaßer ∗ ¨ Informatik IV Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2003-04-21 14:49:45 Computability theory Structural complexity theory Complexity classes Mathematical optimization NP-complete P versus NP problem Turing reduction Oracle machine Time complexity Theoretical computer science Computational complexity theory Applied mathematics
123	Teaching Statement Scott Aaronson January 6, 2007 My basic proposal is to sing the ideas of theoretical computer science from the rooftops—by creating new undergraduate courses, training graduate students, helping tale Add to Reading List Source URL: scottaaronson.com Language: English - Date: 2007-01-07 23:25:27 Mathematical optimization Complexity classes NP-complete Computational complexity theory Algorithm P versus NP problem Quantum mechanics Quantum computer Sanjeev Arora Theoretical computer science Applied mathematics Mathematics
124	The Informational Content of Canonical Disjoint NP-Pairs Christian Glaßer ∗ Alan L. Selman† Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2007-08-15 14:41:53 Complexity classes NP PP Oracle machine Polynomial P P versus NP problem Matroid Theoretical computer science Computational complexity theory Applied mathematics
125	Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems Christian Glaßer ∗ Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2005-07-07 15:16:38 Complexity classes Computability theory Structural complexity theory Mathematical optimization NP-complete NP P versus NP problem Oracle machine Function Theoretical computer science Computational complexity theory Applied mathematics
126	Complete Distributional Problems, Hard Languages, and Resource-Bounded Measure A. Pavan† Alan L. Selman‡ Department of Computer Science University at Buffalo Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 1997-10-21 12:14:50 Complexity classes NP-complete P Time complexity Reduction Many-one reduction P versus NP problem NP-hard Theoretical computer science Computational complexity theory Applied mathematics
127	A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP Ashish V. Naik Alan L. Selman† Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 1997-10-21 12:46:24 Complexity classes Structural complexity theory Mathematical optimization Conjectures P versus NP problem NP P Time complexity Reduction Theoretical computer science Computational complexity theory Applied mathematics
128	Redundancy in Complete Sets Christian Glaßer∗, A. Pavan†, Alan L. Selman‡, Liyu Zhang§ July 6, 2005 Abstract We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2005-07-07 14:54:47 Complexity classes Structural complexity theory Conjectures Mathematical optimization P versus NP problem PP NP Polynomial hierarchy P Theoretical computer science Computational complexity theory Applied mathematics
129	Autoreducibility, Mitoticity, and Immunity Christian Glaßer∗, Mitsunori Ogihara†, A. Pavan‡, Alan L. Selman§, Liyu Zhang¶ December 27, 2004 Abstract We show the following results regarding complete sets. Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2004-12-27 11:32:14 Complexity classes Structural complexity theory Mathematical optimization Probabilistic complexity theory NP PP Polynomial hierarchy PSPACE-complete P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
130	Bi-Immunity Separates Strong NP-Completeness Notions A. Pavan?1 and Alan L Selman2 1 2 Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2001-12-13 15:38:53 NP-complete NP P Combinatory logic P versus NP problem Computational complexity theory Theoretical computer science Complexity classes Applied mathematics

UPDATE